Two-group knapsack game

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-person Knapsack Game

In this paper, we study a two-person knapsack game. Two investors, each with an individual budget, bid on a common pool of potential projects. To undertake a project, investors have their own cost estimation to be charged against their budgets. Associated with each project, there is a potential market profit that can be taken by the only bidder or shared proportionally by both bidders. The obje...

متن کامل

Cyclic group and knapsack facets

Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another.

متن کامل

On Two Dimensional Orthogonal Knapsack Problem

In this paper, we study the following knapsack problem: Given a list of squares with profits, we are requested to pack a sublist of them into a rectangular bin (not a unit square bin) to make profits in the bin as large as possible. We first observe there is a Polynomial Time Approximation Scheme (PTAS) for the problem of packing weighted squares into rectangular bins with large resources, then...

متن کامل

Cryptanalysis of two knapsack public-key cryptosystems

In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new permutation algorithm named Permutation Combination Algorithm. We show that this permutation algorithm is useless to the security of the cryptosystem. Because of the special super increasing structure, we can break this cryptosystem use the method provided by Shamir a...

متن کامل

Distribution Design of Two Rival Decenteralized Supply Chains: a Two-person Nonzero Sum Game Theory Approach

We consider competition between two decentralized supply chains network under demand uncertainty. Each chain consists of one risk-averse manufacturer and a group of risk-averse retailers. These two chains present substitutable products to the geographical dispensed markets. The markets’ demands are contingent upon prices, service levels, and advertising efforts of two supply chains. We formulat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2010

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.12.002